Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
Identifieur interne : 000207 ( LNCS/Analysis ); précédent : 000206; suivant : 000208Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
Auteurs : Flemming Nielson [Danemark] ; Hanne Riis Nielson [Danemark] ; Helmut Seidl [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2002.
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
Abstract: We exhibit a rich class of Horn clauses, which we call $$ \mathcal{H}_{\text{1}} $$ , whose least models, though possibly infinite, can be computed effectively. We show that the least model of an $$ \mathcal{H}_{\text{1}} $$ clause consists of so-called strongly recognizable relations and present an exponential normalization procedure to compute it. In order to obtain a practical tool for program analysis, we identify a restriction of $$ \mathcal{H}_{\text{1}} $$ clauses, which we call $$ \mathcal{H}_{\text{2}} $$ , where the least models can be computed in polynomial time. This fragment still allows to express, e.g., Cartesian product and transitive closure of relations. Inside $$ \mathcal{H}_{\text{2}} $$ , we exhibit a fragment $$ \mathcal{H}_{\text{3}} $$ where normalization is even cubic. We demonstrate the usefulness of our approach by deriving a cubic control-flow analysis for the Spi calculus [1] as presented in [14].
Url:
DOI: 10.1007/3-540-45789-5_5
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001454
- to stream Istex, to step Curation: 001342
- to stream Istex, to step Checkpoint: 000B49
- to stream Main, to step Merge: 001E89
- to stream PascalFrancis, to step Corpus: 000C41
- to stream PascalFrancis, to step Curation: 000274
- to stream PascalFrancis, to step Checkpoint: 000A87
- to stream Main, to step Merge: 001F52
- to stream Main, to step Curation: 001C40
- to stream Main, to step Exploration: 001C40
- to stream LNCS, to step Extraction: 000207
Links to Exploration step
ISTEX:86E718368D98B82C7571E0E8936C2D6F2896A139Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi</title><author><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name></author><author><name sortKey="Nielson, Hanne Riis" sort="Nielson, Hanne Riis" uniqKey="Nielson H" first="Hanne Riis" last="Nielson">Hanne Riis Nielson</name></author><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:86E718368D98B82C7571E0E8936C2D6F2896A139</idno><date when="2002" year="2002">2002</date><idno type="doi">10.1007/3-540-45789-5_5</idno><idno type="url">https://api.istex.fr/document/86E718368D98B82C7571E0E8936C2D6F2896A139/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001454</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001454</idno><idno type="wicri:Area/Istex/Curation">001342</idno><idno type="wicri:Area/Istex/Checkpoint">000B49</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000B49</idno><idno type="wicri:doubleKey">0302-9743:2002:Nielson F:normalizable:horn:clauses</idno><idno type="wicri:Area/Main/Merge">001E89</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:03-0334255</idno><idno type="wicri:Area/PascalFrancis/Corpus">000C41</idno><idno type="wicri:Area/PascalFrancis/Curation">000274</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000A87</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000A87</idno><idno type="wicri:doubleKey">0302-9743:2002:Nielson F:normalizable:horn:clauses</idno><idno type="wicri:Area/Main/Merge">001F52</idno><idno type="wicri:Area/Main/Curation">001C40</idno><idno type="wicri:Area/Main/Exploration">001C40</idno><idno type="wicri:Area/LNCS/Extraction">000207</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi</title><author><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name><affiliation wicri:level="1"><country xml:lang="fr">Danemark</country><wicri:regionArea>Informatics and Mathematical Modelling, Technical University of Denmark, DK-2800, Kongens Lyngby</wicri:regionArea><wicri:noRegion>Kongens Lyngby</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Danemark</country></affiliation></author><author><name sortKey="Nielson, Hanne Riis" sort="Nielson, Hanne Riis" uniqKey="Nielson H" first="Hanne Riis" last="Nielson">Hanne Riis Nielson</name><affiliation wicri:level="1"><country xml:lang="fr">Danemark</country><wicri:regionArea>Informatics and Mathematical Modelling, Technical University of Denmark, DK-2800, Kongens Lyngby</wicri:regionArea><wicri:noRegion>Kongens Lyngby</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Danemark</country></affiliation></author><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Universität Trier, FB IV - Informatik, D-54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2002</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">86E718368D98B82C7571E0E8936C2D6F2896A139</idno><idno type="DOI">10.1007/3-540-45789-5_5</idno><idno type="ChapterID">5</idno><idno type="ChapterID">Chap5</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Horn clauses</term><term>Polynomial time</term><term>Program analysis</term><term>Spi calculus</term><term>Transitive closure</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Analyse programme</term><term>Clause Horn</term><term>Fermeture transitive</term><term>Spi calcul</term><term>Temps polynomial</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We exhibit a rich class of Horn clauses, which we call $$ \mathcal{H}_{\text{1}} $$ , whose least models, though possibly infinite, can be computed effectively. We show that the least model of an $$ \mathcal{H}_{\text{1}} $$ clause consists of so-called strongly recognizable relations and present an exponential normalization procedure to compute it. In order to obtain a practical tool for program analysis, we identify a restriction of $$ \mathcal{H}_{\text{1}} $$ clauses, which we call $$ \mathcal{H}_{\text{2}} $$ , where the least models can be computed in polynomial time. This fragment still allows to express, e.g., Cartesian product and transitive closure of relations. Inside $$ \mathcal{H}_{\text{2}} $$ , we exhibit a fragment $$ \mathcal{H}_{\text{3}} $$ where normalization is even cubic. We demonstrate the usefulness of our approach by deriving a cubic control-flow analysis for the Spi calculus [1] as presented in [14].</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Danemark</li></country></list><tree><country name="Danemark"><noRegion><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name></noRegion><name sortKey="Nielson, Flemming" sort="Nielson, Flemming" uniqKey="Nielson F" first="Flemming" last="Nielson">Flemming Nielson</name><name sortKey="Nielson, Hanne Riis" sort="Nielson, Hanne Riis" uniqKey="Nielson H" first="Hanne Riis" last="Nielson">Hanne Riis Nielson</name><name sortKey="Nielson, Hanne Riis" sort="Nielson, Hanne Riis" uniqKey="Nielson H" first="Hanne Riis" last="Nielson">Hanne Riis Nielson</name></country><country name="Allemagne"><noRegion><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></noRegion><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000207 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000207 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:86E718368D98B82C7571E0E8936C2D6F2896A139
|texte= Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
}}
| This area was generated with Dilib version V0.6.31. |  |